semigroup of automata

См. также в других словарях:

• Automata theory — Automata is defined as a system where energy, information and material is transformed, transmitted and used for performing some function without the direct participation of man .In theoretical computer science, automata theory is the study of… …   Wikipedia

• Semigroup action — In algebra and theoretical computer science, an action or act of a semigroup on a set is a rule which associates to each element of the semigroup a transformation of the set in such a way that the product of two elements of the semigroup (using… …   Wikipedia

• Semigroup — This article is about the algebraic structure. For applications to differential equations, see C0 semigroup. In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative binary operation. A semigroup… …   Wikipedia

• Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and …   Wikipedia

• Semiautomaton — In mathematics and theoretical computer science, a semiautomaton is an automaton having only an input, and no output. It consists of a set Q of states, a set Σ called the input alphabet, and a function T: Q × Σ → Q called the transition function …   Wikipedia

• Avraham Trahtman — Infobox Scientist name = Avraham Trahtman box width = | image width = caption = birth date = birth place = death date = death place = residence = Jerusalem, Israel citizenship = nationality = ethnicity = field = Mathematics work institutions =… …   Wikipedia

• Sequence — For other uses, see Sequence (disambiguation). In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements or terms), and the number of terms (possibly infinite) is called the length …   Wikipedia

• Free monoid — In abstract algebra, the free monoid on a set A is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from A , with the binary operation of concatenation. It is usually denoted A lowast;. The identity… …   Wikipedia

• Aperiodic monoid — In mathematics, an aperiodic semigroup is a semigroup S such that for every x ∈ S , there exists a nonnegative integer n such that xn = xn + 1 .An aperiodic monoid is an aperiodic semigroup which is a monoid. This notion is in some sense… …   Wikipedia

• Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

• John R. Stallings — John Robert Stallings is a mathematician known for his seminal contributions to geometric group theory and 3 manifold topology. Stallings is a Professor Emeritus in the Department of Mathematics and the University of California at Berkeley. [… …   Wikipedia